Lifting inequalities for polytopes
نویسنده
چکیده
We present a method of lifting linear inequalities for the flag f -vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for 6-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions 5 through 8.
منابع مشابه
Inequalities for Zonotopes
We present two classes of linear inequalities that the flag f vectors of zonotopes satisfy. These inequalities strengthen inequalities for polytopes obtained by the lifting technique of Ehrenborg.
متن کاملLifting the toric g - vector inequalities ∗
We present a method of lifting linear inequalities for the flag f -vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for 6-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions...
متن کاملOn the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
In an earlier paper [I1 we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or S2. -iT this paper we connects/that characterization to the theory of facet lifting. In particular, we-introduc~ a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all th...
متن کاملSimultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Cover inequalities are commonly used cutting planes for the 0–1 knapsack problem. This paper describes a linear-time algorithm (assuming the knapsack is sorted) to simultaneously lift a set of variables into a cover inequality. Conditions for this process to result in valid and facet-defining inequalities are presented. In many instances, the resulting simultaneously lifted cover inequality can...
متن کاملFacets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alternative approach, in which we keep in the model only the continuous variables, and we tighten th...
متن کامل